Automated Proof Planning for Instructional Design
نویسندگان
چکیده
Automated theorem proving based on proof planning is a new and promising paradigm in the field of automated deduction. The idea is to use methods and heuristics as they are used by human mathematicians and encode this knowledge into so-called methods. Naturally, the question arises whether these methods can be beneficially used in learning mathematics too. This paper investigates and compares the effect of different instruction materials (textbook-based, example-based, and method-based) on problem solving performance. The results indicate that the performance for the method-based instruction derived from automated proof planning in the ΩMEGA system is superior to that of the other instructions that were derived from a textbook and an example-based classroom lesson. These results provide a first support for introducing proof planning based on methodological knowledge into the school curriculum for mathematics.
منابع مشابه
Automated instructional design for CSCL: A hierarchical task network planning approach
In Computer Supported Collaborative Learning (CSCL), one of the most important tasks for instructional designers is to define scenarios that foster group learning. Such scenarios, defined as Units of Learning (UoLs), comprise different components and are organized according to pedagogical approaches to orchestrate group learning processes. Examples of UoL components are learning objects, studen...
متن کاملAI-Techniques in Proof Planning
Proof planning is an application of Artiicial Intelligence (AI)-planning in mathematical domains for theorem proving. The paper presents a knowledge-based proof planning approach that is implemented in the OMEGA proof planner. It evaluates control-rules in order to restrict the otherwise intractable search spaces and combines proof planning with domain-speciic constraint solving. Several AI-tec...
متن کاملLess is More: Using Grice's Maxim of Quantity to Generate Instructional Text
Plans produced by AI planning systems have the potential to serve as the underlying action representation for systems that generate instructional texts. However, there is more detail in even the simplest of plan data structures than there is in a typically plan description used by people. This paper describes a operational de nition of Grice's maxim of quantity that guides the selection of appr...
متن کاملTowards a Framework to Integrate Proof Search Paradigms
Research on automated and interactive theorem proving aims at the mechanization of logical reasoning. Aside from the development of logic calculi it became rapidly apparent that the organization of proof search on top of the calculi is an essential task in the design of powerful theorem proving systems. Different paradigms of how to organize proof search have emerged in that area of research, t...
متن کاملRepresenting Proof-Planning in the ρ-Calculus
Introduction. Proof planning is a theorem proving technique in which proofs are not conceived immediately by using the low-level calculus rules but at a higher level of abstraction that highlights the main ideas and the outline of a proof and de-emphasizes minor logical or mathematical manipulations on formulae. Hence, proof planning considerably differs from traditional proof search strategies...
متن کامل